Multiple-correction and faster approximation
نویسندگان
چکیده
منابع مشابه
Faster Least Squares Approximation
Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets n be the number of constraints and d be the number of variables, with n d. Then, existing exact methods find a solution vector in O(nd2) time. We present two randomized algorithms that provide accurate relative-error approximations...
متن کاملfragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولFaster Algorithms via Approximation Theory
This monograph presents ideas and techniques from approximation theory for approximating functions such as xs, x−1 and e−x, and demonstrates how these results play a crucial role in the design of fast algorithms for problems which are increasingly relevant. The key lies in the fact that such results imply faster ways to compute primitives such as Asv, A−1v, exp(−A)v, eigenvalues, and eigenvecto...
متن کاملFaster and Simpler Approximation of Stable Matchings
We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extensio...
متن کاملFaster approximation for Symmetric Min-Power Broadcast
Given a directed simple graph G = (V,E) and a cost function c : E → R+, the power of a vertex u in a directed spanning subgraph H is given by pH(u) = maxuv∈E(H) c(uv), and corresponds to the energy consumption required for the wireless node u to transmit to all nodes v with uv ∈ E(H). The power of H is given by p(H) = ∑ u∈V pH(u). Power Assignment seeks to minimize p(H) while H satisfies some c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2015
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2014.10.016